E-generalization using grammars
نویسندگان
چکیده
منابع مشابه
E-Generalization Using Grammars
We extend the notion of anti-unification to cover equational theories and present a method based on regular tree grammars to compute a finite representation of E-generalization sets. We present a framework to combine Inductive Logic Programming and E-generalization that includes an extension of Plotkin’s lgg theorem to the equational case. We demonstrate the potential power of E-generalization ...
متن کاملGeneralization in Context Sensitive Grammars
An alternative to the recognition systems used so far can be systems based on context sensitive grammars. A precondition for success will be an implementation with great capacity for generalization. We propose three methods of generalization based on the assumption that similar stimuli invoke similar or identical reactions.
متن کاملPriority Union and Generalization in Discourse Grammars
We describe an implementation in Carpenter's typed feature formalism, ALE, of a discourse grammar of the kind proposed by Scha, Polanyi, et al. We examine their method for resolving parallelism-dependent anaphora and show that there is a coherent feature-structural rendition of this type of grammar which uses the operations of prwrity union and generalization. We describe an augmentation of the...
متن کاملA Generalization of the Offline Parsable Grammars
The offline parsable grammars apparently have enough formal power to describe human language, yet the parsing problem for these grammars is solvable. Unfortunately they exclude grammars that use x-bar theory and these grammars have strong linguistic justification. We define a more general class of unification grammars, which admits x-bar grammars while preserving the desirable properties of off...
متن کاملA Generalization of Linear Indexed Grammars Equivalent to Simple Context-Free Tree Grammars
I define a generalization of linear indexed grammars that is equivalent to simple context-free tree grammars in the same way that linear indexed grammars are equivalent to tree-adjoining grammars.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2005
ISSN: 0004-3702
DOI: 10.1016/j.artint.2005.01.008